Approximation of Planar Convex Sets from Hyperplane Probes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind approximation of planar convex sets

The process of learning the shape of an unknown convex planar object through an adaptive process of simple measurements called Line probings, which reveal tangent lines to the object, is considered. A systematic probing strategy is suggested and an upper bound on the number of probings it requires for achieving an approximation with a pre-specified precision to the unknown object is derived. A ...

متن کامل

Interpolation and Approximation from Convex Sets

Let X be a topological vector space, Y = IR n , n 2 IN, A a continuous linear map from X to Y , C X, B a convex set dense in C, and d 2 Y a data point. We derive conditions which guarantee that the set B \ A ?1 (d) is nonempty and dense in C \ A ?1 (d). Some applications to shape preserving interpolation and approximation are described.

متن کامل

Adaptive Estimation of Planar Convex Sets

In this paper, we consider adaptive estimation of an unknown planar compact, convex set from noisy measurements of its support function. Both the problem of estimating the support function at a point and that of estimating the whole convex set are studied. For pointwise estimation, we consider the problem in a general non-asymptotic framework, which evaluates the performance of a procedure at e...

متن کامل

k-Sets of Convex Inclusion Chains of Planar Point Sets

Given a set V of n points in the plane, we introduce a new number of k-sets that is an invariant of V : the number of k-sets of a convex inclusion chain of V . A convex inclusion chain of V is an ordering (v1, v2, ..., vn) of the points of V such that no point of the ordering belongs to the convex hull of its predecessors. The k-sets of such a chain are then the distinct k-sets of all the subse...

متن کامل

Slicing Convex Sets and Measures by a Hyperplane

Given convex bodies K1, . . . ,Kd in R and numbers α1, . . . , αd ∈ [0,1], we give a sufficient condition for existence and uniqueness of an (oriented) halfspace H with Vol(H ∩Ki) = αi · VolKi for every i. The result is extended from convex bodies to measures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 1997

ISSN: 0179-5376

DOI: 10.1007/pl00009313